A Quadratic Eigenvalue Problem
نویسنده
چکیده
Let P, Q be compact selfadjoint operators in a Hilbert space. It is proven that the characteristic and associated vectors of the quadratic eigenvalue problem, x=\Px + (\¡X)Qx, form a Riesz basis for the cartesian product of the closure of the range of P and the closure of the range of Q. 1. Investigations in the theory of hydrodynamic stability (cf. [3, Chapter X] ; [8]) lead to the search for expansion theorems associated with the following characteristic value problem. Let £, Q be compact selfadjoint operators in a Hilbert space H and for x £ H let A(X)x = XPx + (l¡X)Qx. a, the spectrum of A(X), is defined as the set of all complex numbers X for which I—A(X) does not have a bounded inverse defined on all of H. p, the resolvent of A(X), is the complement of a in the complex plane. A number X^O is a characteristic value of A(X) if the equation (1) x = A(X0)x = X0Px + (l/X0)Qx has nonzero solutions. Any such x is called a characteristic vector of A(X) corresponding to X=X0. Since any nonzero number on the imaginary axis is in p, it follows that a is at most countable (cf. [5, p. 21]). All nonzero points in o are isolated characteristic values whose only possible limit points are 0 and oo. Thus, via the transformation X~*aX, a>0, it may be assumed without loss of generality that ±1 e />. Following [4] the characteristic values are poles of the function (I-A(X))"1, which is analytic on p. Presented to the Society, January 17, 1972 under the title Bases associated with a quadratic eigenvalue problem; received by the editors September 25, 1972. AMS (MOS) subject classifications (1970). Primary 47B50, 35P10, 76E99; Secondary 46D05.
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملElliptic and hyperbolic quadratic eigenvalue problems and associated distance problems
Two important classes of quadratic eigenvalue problems are composed of elliptic and hyperbolic problems. In [Linear Algebra Appl., 351–352 (2002) 455], the distance to the nearest non-hyperbolic or non-elliptic quadratic eigenvalue problem is obtained using a global minimization problem. This paper proposes explicit formulas to compute these distances and the optimal perturbations. The problem ...
متن کاملRegularized Total Least Squares Based on Quadratic Eigenvalue Problem Solvers
This paper presents a new computational approach for solving the Regularized Total Least Squares problem. The problem is formulated by adding a quadratic constraint to the Total Least Square minimization problem. Starting from the fact that a quadratically constrained Least Squares problem can be solved via a quadratic eigenvalue problem, an iterative procedure for solving the regularized Total...
متن کاملA semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems
In this paper, we are concerned with the computation of a few eigenpairs with smallest eigenvalues in absolute value of quadratic eigenvalue problems. We first develop a semiorthogonal generalized Arnoldi method where the name comes from the application of a pseudo inner product in the construction of a generalized Arnoldi reduction [25] for a generalized eigenvalue problem. The method applies ...
متن کاملOn the quadratic two-parameter eigenvalue problem and its linearization ?
We introduce the quadratic two-parameter eigenvalue problem and linearize it as a singular two-parameter eigenvalue problem. This, together with an example from model updating, shows the need for numerical methods for singular two-parameter eigenvalue problems and for a better understanding of such problems. There are various numerical methods for two-parameter eigenvalue problems, but only few...
متن کاملLocking and Restarting Quadratic Eigenvalue Solvers
This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from nite-element simulations in acoustics. One approach is the shift-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or de-ation of converged eigenvectors (or Schur vect...
متن کامل